Fast Witness Extraction Using a Decision Oracle

The gist of many (NP-)hard combinatorial problems is to decide whether a universe of $n$ elements contains a witness consisting of $k$ elements that match some prescribed pattern. For some of these problems there are known advanced algebra-based FPT algorithms which solve the decision problem but do not return the witness. We investigate techniques for turning such a YES/NO-decision oracle into an algorithm for extracting a single witness, with an objective to obtain practical scalability for large values of $n$. By relying on techniques from combinatorial group testing, we demonstrate that a witness may be extracted with $O(k\log n)$ queries to either a deterministic or a randomized set inclusion oracle with one-sided probability of error. Furthermore, we demonstrate through implementation and experiments that the algebra-based FPT algorithms are practical, in particular in the setting of the $k$-path problem. Also discussed are engineering issues such as optimizing finite field arithmetic.Comment: Journal version, 16 pages. Extended abstract presented at ESA'1

Network of Minima of the Thomson Problem and Smale's 7th Problem

The Thomson problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here, we show that the energy landscape of the Thomson problem for N particles with N=132, 135, 138, 141, 144, 147, and 150 is single funneled, characteristic of a structure-seeking organization where the global minimum is easily accessible. Algorithmically, constructing starting points close to the global minimum of such a potential with spherical constraints is one of Smale’s 18 unsolved problems in mathematics for the 21st century because it is important in the solution of univariate and bivariate random polynomial equations. By analyzing the kinetic transition networks, we show that a randomly chosen minimum is, in fact, always “close” to the global minimum in terms of the number of transition states that separate them, a characteristic of small world networks

Rigidity percolation by next-nearest-neighbor bonds on generic and regular isostatic lattices.

Theoretical Physic

Matroid and Knapsack Center Problems

In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important generalizations of $k$-center, the matroid center problem and the knapsack center problem. Both problems are motivated by recent content distribution network applications. Our contributions can be summarized as follows: 1. We consider the matroid center problem in which the centers are required to form an independent set of a given matroid. We show this problem is NP-hard even on a line. We present a 3-approximation algorithm for the problem on general metrics. We also consider the outlier version of the problem where a given number of vertices can be excluded as the outliers from the solution. We present a 7-approximation for the outlier version. 2. We consider the (multi-)knapsack center problem in which the centers are required to satisfy one (or more) knapsack constraint(s). It is known that the knapsack center problem with a single knapsack constraint admits a 3-approximation. However, when there are at least two knapsack constraints, we show this problem is not approximable at all. To complement the hardness result, we present a polynomial time algorithm that gives a 3-approximate solution such that one knapsack constraint is satisfied and the others may be violated by at most a factor of $1+\epsilon$. We also obtain a 3-approximation for the outlier version that may violate the knapsack constraint by $1+\epsilon$.Comment: A preliminary version of this paper is accepted to IPCO 201

Mechanical Weyl Modes in Topological Maxwell Lattices

Theoretical Physic

Nernst Effect and Anomalous Transport in Cuprates: A Preformed-Pair Alternative to the Vortex Scenario

We address those puzzling experiments in underdoped high $T_c$ superconductors which have been associated with normal state "vortices" and show these data can be understood as deriving from preformed pairs with onset temperature $T^* > T_c$. For uncorrelated bosons in small magnetic fields, and arbitrary $T^*/T_c$, we present the exact contribution to \textit{all} transport coefficients. In the overdoped regime our results reduce to those of standard fluctuation theories ($T^*\approx T_c$). Semi-quantitative agreement with Nernst, ac conductivity and diamagnetic measurements is quite reasonable.Comment: 9 pages, 4 figures; Title, abstract and contents modified, new references added, figures changed, one more figure added; to be published on PR

Noncommutative geometry, Quantum effects and DBI-scaling in the collapse of D0-D2 bound states

We study fluctuations of time-dependent fuzzy two-sphere solutions of the non-abelian DBI action of D0-branes, describing a bound state of a spherical D2-brane with N D0-branes. The quadratic action for small fluctuations is shown to be identical to that obtained from the dual abelian D2-brane DBI action, using the non-commutative geometry of the fuzzy two-sphere. For some of the fields, the linearized equations take the form of solvable Lam\'e equations. We define a large-N DBI-scaling limit, with vanishing string coupling and string length, and where the gauge theory coupling remains finite. In this limit, the non-linearities of the DBI action survive in both the classical and the quantum context, while massive open string modes and closed strings decouple. We describe a critical radius where strong gauge coupling effects become important. The size of the bound quantum ground state of multiple D0-branes makes an intriguing appearance as the radius of the fuzzy sphere, where the maximal angular momentum quanta become strongly coupled.Comment: 34 pages, Latex; v2: Minor correction in conformal transformation of couplings, references adde

D-term cosmic strings from N=2 Supergravity

We describe new half-BPS cosmic string solutions in N=2, d=4 supergravity coupled to one vector multiplet and one hypermultiplet. They are closely related to D-term strings in N=1 supergravity. Fields of the N=2 theory that are frozen in the solution contribute to the triplet moment map of the quaternionic isometries and leave their trace in N=1 as a constant Fayet-Iliopoulos term. The choice of U(1) gauging and of special geometry are crucial. The construction gives rise to a non-minimal Kaehler potential and can be generalized to higher dimensional quaternionic-Kaehler manifolds.Comment: 37 pages, LaTeX, v2: minor corrections, references added, version to be published in JHE

On the perturbative chiral ring for marginally deformed N=4 SYM theories

For \cal{N}=1 SU(N) SYM theories obtained as marginal deformations of the \cal{N}=4 parent theory we study perturbatively some sectors of the chiral ring in the weak coupling regime and for finite N. By exploiting the relation between the definition of chiral ring and the effective superpotential we develop a procedure which allows us to easily determine protected chiral operators up to n loops once the superpotential has been computed up to (n-1) order. In particular, for the Lunin-Maldacena beta-deformed theory we determine the quantum structure of a large class of operators up to three loops. We extend our procedure to more general Leigh-Strassler deformations whose chiral ring is not fully understood yet and determine the weight-two and weight-three sectors up to two loops. We use our results to infer general properties of the chiral ring.Comment: LaTex, 40 pages, 4 figures, uses JHEP3; v2: minor correction